Ranking Tweets by Labeled and Collaboratively Selected Pairs with Transitive Closure
نویسندگان
چکیده
Tweets ranking is important for information acquisition in Microblog. Due to the content sparsity and lack of labeled data, it is better to employ semi-supervised learning methods to utilize the unlabeled data. However, most of previous semi-supervised learning methods do not consider the pair conflict problem, which means that the new selected unlabeled data may have order conflict with the labeled and previously selected data. It will hurt the learning performance, if the training data contains many conflict pairs. In this paper, we propose a new collaborative semi-supervised SVM ranking model (CSR-TC), selecting unlabeled data based on a dynamically maintained transitive closure graph to avoid pair conflict. We also investigate the two views of features, intrinsic and content-relevant features, for the proposed model. Extensive experiments are conducted on TREC Microblogging corpus. The results demonstrate that our proposed method achieves significant improvement, compared to several state-of-the-art models.
منابع مشابه
The Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution
This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...
متن کاملTransitive Closure of Innnite Graphs and Its Applications Transitive Closure of Innnite Graphs and Its Applications
Integer tuple relations can concisely summarize many types of information gathered from analysis of scientiic codes. For example they can be used to precisely describe which iterations of a statement are data dependent of which other iterations. It is generally not possible to represent these tuple relations by enumerating the related pairs of tuples. For example, it is impossible to enumerate ...
متن کاملEecient Transitive Closure Computation
We present two new transitive closure algorithms that are based on strong component detection. The algorithms scan the input graph only once without generating partial successor sets for each node. The new algorithms eliminate the redundancy caused by strong components more e ciently than previous transitive closure algorithms. We present statistically sound simulation experiments showing that ...
متن کاملOn the Computation of the Transitive Closure of Relational Operators
Query processing in the presence of recursively defined views usually involves some form of iteration. For example, computing the transitive closure of a tree involves iterating N times, where N is the depth of the tree, each time computing pairs of vertices that are one edge further apart than the pairs produced in the previous iteration. Applying a divide and conquer technique we devise algor...
متن کاملComparing Downward Fragments of the Relational Calculus with Transitive Closure on Trees
Motivated by the continuing interest in the tree data model, we study the expressive power of downward navigational query languages on trees and chains. Basic navigational queries are built from the identity relation and edge relations using composition and union. We study the effects on relative expressiveness when we add transitive closure, projections, coprojections, intersection, and differ...
متن کامل